منابع مشابه
Ioco Theory for Probabilistic Automata
Model-based testing (MBT) is an well-known technology, which allows for automatic test case generation, execution and evaluation. To test non-functional properties, a number of test MBT frameworks have been developed to test systems with real-time, continuous behaviour, symbolic data and quantitative system aspects. Notably, a lot of these frameworks are based on Tretmans’ classical input/outpu...
متن کاملAnalysis of Probabilistic Processes and Automata Theory
This chapter surveys some basic algorithms for analyzing Markov chains (MCs) and Markov decision processes (MDPs), and discusses their computational complexity. We focus on discrete-time processes, and we consider both finite-state models as well as countably infinite-state models that are finitely-presented. The analyses we will primarily focus on are hitting (reachability) probabilities and ω...
متن کاملA theory of probabilistic automata, part 1
In the book we present main concepts of probabilistic automata theory.
متن کاملComplementarity for Probabilistic Automata
Motivated by Mermin’s analysis of Einstein-Podolsky-Rosen correlations [25] and [6] we study two computational complementarity principles introduced in [7] for a class of probabilistic automata. We prove the existence of probabilistic automata featuring both types of computational complementarity and we present a method to reduce, under certain conditions, the study of computational complementa...
متن کاملCompositionality for Probabilistic Automata
We establish that on the domain of probabilistic automata, the trace distribution preorder coincides with the simulation preorder.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2015
ISSN: 2075-2180
DOI: 10.4204/eptcs.180.2